SMT-Based Constraint Answer Set Solver EZSMT (System Description)

Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. Recently, the formal link between this research area and satisfiability modulo theories (or SMT) was established. This link allows the cross-fertilization between traditionally different solving technologies. The paper presents the system ezsmt, one of the first SMT-based solvers for constraint answer set programming. It also presents the comparative analysis of the performance of ezsmt in relation to its peers including solvers ezcsp, clingcon, and mingo. Experimental results demonstrate that SMT is a viable technology for constraint answer set programming. 1998 ACM Subject Classification D.1.6 [Programming Techniques] Logic Programming, D.3.2 [Programming Languages] Language Classifications – Constraint and Logic Languages, F.4.1 [Mathematical Logic and Formal Languages] Mathematical Logic – Logic and Constraint Programming